On The Admissible Rules of Intuitionistic Propositional Logic
نویسنده
چکیده
We present a basis for the admissible rules of intuitionistic proposi-tional logic. Thereby a conjecture by de Jongh and Visser is proved. We also present a proof system for the admissible rules, and give semantic criteria for admissibility.
منابع مشابه
Rules and Arithmetics
This paper is concerned with the logical structure of arithmetical the ories We survey results concerning logics and admissible rules of con structive arithmetical theories We prove a new theorem the admissible propositional rules of Heyting Arithmetic are the same as the admissible propositional rules of Intuitionistic Propositional Logic We provide some further insights concerning predicate l...
متن کاملAdmissible and Derivable Rules in Intuitionistic Logic
A well-known problem in intuitionistic logic is the existence of valid but not derivable rules. This problem seems to be related with some constructive features of intuitionism (disjunction and existence property) but appear also in modal logics. We study here a particular case of this phenomenon, admissible rules in propositional calculus. G.E.Mints in [Mi 72] give sufficients conditions for a...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملFrom de Jongh’s theorem to intuitionistic logic of proofs
The famous de Jongh’s theorem of 1970 stated that the intuitionistic logic captured all the logical formulas which have all arithmetical instances derivable in the Heyting Arithmetic HA. In this note we extend de Jongh’s arithmetical completeness property from IPC to the basic intuitionistic logic of proofs, which allows proof assertion statements of the sort x is a proof of F. The logic of pro...
متن کاملUnification in the normal modal logic Alt1
The unification problem in a logical system L can be defined in the following way: given a formula φ(x1, . . . , xα), determine whether there exists formulas ψ1, . . ., ψα such that φ(ψ1, . . . , ψα) is in L. The research on unification for modal logics was originally motivated by the admissibility problem for rules of inference: given a rule of inference φ1(x1, . . . , xα), . . . , φm(x1, . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 66 شماره
صفحات -
تاریخ انتشار 2001